Hazelnut: a bidirectionally typed structure editor calculus

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Typed Pattern Calculus

The theory of programming with pattern-matching function deenitions has been studied mainly in the framework of rst-order rewrite systems. We present a typed functional calculus that emphasizes the strong connection between the structure of whole pattern deenitions and their types. In this calculus type-checking guarantees the absence of runtime errors caused by non-exhaustive pattern-matching ...

متن کامل

A typed context calculus

This paper develops a typed calculus for contexts i.e., lambda terms with \holes".In addition to ordinary lambda terms, the calculus contains labeled holes, hole ab-straction and context application for manipulating rst-class contexts. The primaryoperation for contexts is holelling, which captures free variables. This operationcon icts with substitution of the lambda calculus, a...

متن کامل

A Typed Interrupt Calculus

Most real-time systems require responsive interrupt handling. Programming of interrupt handlers is challenging: in order to ensure responsiveness, it is often necessary to have interrupt processing enabled in the body of lower priority handlers. It would be a programming error to allow the interrupt handlers to interrupt each other in a cyclic fashion; it could lead to an unbounded stack. Until...

متن کامل

A Dependently Typed Ambient Calculus

The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access control policies, expressed indirectly via classification of ambients in groups by means of ‘group types.’ The paper presents a theory of dependent types for the Ambient calculus which allows ...

متن کامل

Intersection Typed λ - calculus

The aim of this paper is to discuss the design of an explicitly typed λ-calculus corresponding to the Intersection Type Assignment System (IT ), which assigns intersection types to the untyped λ-calculus. Two different proposals are given. The logical foundation of all of them is the Intersection Logic IL.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 2017

ISSN: 0362-1340,1558-1160

DOI: 10.1145/3093333.3009900